Short Circuit Detection Utilization Analysis under Uniprocessor EDF Scheduling
نویسنده
چکیده
Accounting for all possible short circuits in a direct current circuit can prove to be an arduous process. To avoid unintended operation and circuit damage, short circuit protection may be implemented via hardware or software. This paper views the short circuit detection problem as a hardware-software codesign problem in which an inductor installed in a DC circuit is designed alongside a microcontroller. Although short circuit detection is often a mission-critical process, we provide a framework depicting methods by which a short circuit may be detected by a microcontroller. Additionally, we establish the utilization requirement of the proposed methods and subsequently the remaining utilization under Uniprocessor EDF scheduling.
منابع مشابه
Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems
In this paper we present the utilization bound for Earliest Deadline First (EDF) scheduling on homogeneous multiprocessor systems with partitioning strategies. Assuming that tasks are pre-emptively scheduled on each processor according to the EDF algorithm, and allocated according to the First Fit (FF) heuristic, we prove that the worst-case achievable utilization is 0:5(n + 1), where n is the ...
متن کاملSchedulability Test for Soft Real-Time Systems under Multiprocessor Environment by using an Earliest Deadline First Scheduling Algorithm
This paper deals with the study of Earliest Deadline First (EDF) which is an optimal scheduling algorithm for uniprocessor real time systems use for scheduling the periodic task in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists EDF-based schemes and RMA scheduling (which is the only known way of optimally scheduling recurrent real-time tasks on ...
متن کاملQuantifying the sub-optimality of uniprocessor fixed-priority scheduling∗
There are sporadic task systems schedulable by EDF, which no fixed-priority (FP) algorithm can schedule successfully. For instance, it is known that while all implicit-deadline sporadic task systems with utilization at most one are EDF-schedulable on a unit-capacity uniprocessor, there are implicit-deadline sporadic task systems that are not schedulable by any FP algorithm, and have utilization...
متن کاملPerformance Analysis of Dynamic Priority Scheduling Algorithms in Real Time Systems
A scheduling algorithm is the one which decides a schedule for a given set of tasks. There are a number of algorithms for task scheduling on a processor. Some of these algorithms are used for scheduling tasks on a multiprocessor system either under the partitioning scheme or under the global scheme. The optimal algorithm is the Earliest Deadline First (EDF) algorithm. If a set of task cannot be...
متن کاملUniprocessor EDF Scheduling with Mode Change
Consider the problem of scheduling sporadically-arriving tasks with implicit deadlines using Earliest-Deadline-First (EDF) on a single processor. The system may undergo changes in its operational modes and therefore the characteristics of the task set may change at run-time. We consider a well-established previously published mode-change protocol by Sha et al. and we show that if every mode uti...
متن کامل